Evolutionary learning of dynamic probabilistic models with large time lags
نویسندگان
چکیده
In this paper, we explore the automatic explanation of Multivariate Time Series (MTS) through learning Dynamic Bayesian Networks (DBNs). We have developed an evolutionary algorithm which exploits certain characteristics of process MTS in order to generate good networks as quickly as possible. We compare this algorithm to other standard learning algorithms that have traditionally been used for static Bayesian networks but are adapted for DBNs in this paper. These are tested on both synthetic and real-world MTS. We evaluate sample explanations which have been generated from chemical process data using our methodology, and several useful heuristics, we have found that the proposed method is more efficient for learning DBNs from MTS with large time lags, especially in time-demanding situations.
منابع مشابه
The Automatic Explanation of Multivariate Time Series
Due to the advances in data capture and storage techniques over the last decade, the size of Multivariate Time Series (MTS) data being recorded has grown massively. Many of these MTS are characterised by a large number of interdependent variables with large possible time lags. If new and useful knowledge is to be automatically learnt from this type of data in order to aid the understanding of t...
متن کاملA Probabilistic Model of Learning Fields in Islamic Economics and Finance
In this paper an epistemological model of learning fields of probabilistic events is formalized. It is used to explain resource allocation governed by pervasive complementarities as the sign of unity of knowledge. Such an episteme is induced epistemologically into interacting, integrating and evolutionary variables representing the problem at hand. The end result is the formalization of a p...
متن کاملNovel Radial Basis Function Neural Networks based on Probabilistic Evolutionary and Gaussian Mixture Model for Satellites Optimum Selection
In this study, two novel learning algorithms have been applied on Radial Basis Function Neural Network (RBFNN) to approximate the functions with high non-linear order. The Probabilistic Evolutionary (PE) and Gaussian Mixture Model (GMM) techniques are proposed to significantly minimize the error functions. The main idea is concerning the various strategies to optimize the procedure of Gradient ...
متن کاملMILP models and valid inequalities for the two-machine permutation flowshop scheduling problem with minimal time lags
In this paper, we consider the problem of scheduling on two-machine permutation flowshop with minimal time lags between consecutive operations of each job. The aim is to find a feasible schedule that minimizes the total tardiness. This problem is known to be NP-hard in the strong sense. We propose two mixed-integer linear programming (MILP) models and two types of valid inequalities which aim t...
متن کاملA multi-objective resource-constrained project scheduling problem with time lags and fuzzy activity durations
The resource-constrained project scheduling problem is to find a schedule that minimizes the project duration subject to precedence relations and resource constraints. To further account for economic aspects of the project, one may add an objective of cash nature to the problem. In addition, dynamic nature and variations in real world are known to introduce uncertainties into data. Therefore, t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Int. J. Intell. Syst.
دوره 16 شماره
صفحات -
تاریخ انتشار 2001